Generation of AES Key Dependent S-Boxes using RC4 Algorithm
نویسندگان
چکیده
منابع مشابه
Key-Dependent S-Box Generation in AES Block Cipher System
Advanced Encryption Standard (AES) block cipher system is widely used in cryptographic applications. A nonlinear substitution operation is the main factor of the AES cipher system strength. The purpose of the proposed approach is to generate the random S-boxes changing for every change of the secret key. The fact that the S-boxes are randomly key-dependent and unknown is the main strength of th...
متن کاملSubstitution-permutation Network Cryptosystems Using Key-dependent S-boxes
Substitution-permutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (s-boxes) as a critical internal component. Much of the research into s-boxes has focussed on determining those s-box properties which yield a cryptographically strong SPN. We investigate s-boxes which are generated in a pseudo-random fashion from a key. This approach has the ...
متن کاملSecurity Enhancement in Next Generation Networks using Enhanced AES with RC4 and Dynamic S-box
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Encryption is primary method of protecting valuable electronic information transmitted over the networks. SSL/TLS can help to secure transmitted data using various encryption algorithms. AES is one of ciphering algorithm which is used for encryptio...
متن کاملRandomness analysis and generation of key-derived s-boxes
Although many ciphers use fixed, close to ideal, s-boxes (like AES e.g.), random s-boxes offer an interesting alternative since they have no underlying structure that can be exploited in cryptanalysis. For this reason, some cryptosystems generate pseudorandom s-boxes as a function of the key (key-derived). We analyse the randomness properties of key-derived s-boxes generated by some popular cry...
متن کاملCharacteristics of Key-Dependent S-Boxes: the Case of Twofish
In this paper we analyze and discuss the cryptographic robustness of key-dependent substitution boxes (KDSBs); these can be found in some symmetric-key algorithms such as Khufu, Blowfish, and the AES finalist Twofish. We analyze KDSBs in the framework of composite permutations, completing the theory developed by O’Connor. Under the basic assumption that KDSBs are built choosing permutations ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Conference on Aerospace Sciences and Aviation Technology
سال: 2009
ISSN: 2636-364X
DOI: 10.21608/asat.2009.23497